/**************************************************************************
***    
*** Copyright (c) 1995-2000 Regents of the University of California,
***               Andrew E. Caldwell, Andrew B. Kahng and Igor L. Markov
*** Copyright (c) 2000-2002 Regents of the University of Michigan,
***               Saurabh N. Adya and Igor L. Markov
***
***  Contact author(s): abk@cs.ucsd.edu, imarkov@umich.edu
***  Original Affiliation:   UCLA, Computer Science Department,
***                          Los Angeles, CA 90095-1596 USA
***
***  Permission is hereby granted, free of charge, to any person obtaining 
***  a copy of this software and associated documentation files (the
***  "Software"), to deal in the Software without restriction, including
***  without limitation 
***  the rights to use, copy, modify, merge, publish, distribute, sublicense, 
***  and/or sell copies of the Software, and to permit persons to whom the 
***  Software is furnished to do so, subject to the following conditions:
***
***  The above copyright notice and this permission notice shall be included
***  in all copies or substantial portions of the Software.
***
*** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
*** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
*** OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 
*** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
*** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT
*** OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
*** THE USE OR OTHER DEALINGS IN THE SOFTWARE.
***
***
***************************************************************************/



//created by Andrew Caldwell and Igor Markov on 05/25/98

#ifdef _MSC_VER
#pragma warning(disable:4786)
#endif

#include <iostream>
#include "gainList.h"

void GainList::insertAhead (GainList& toAdd)
{
    if(toAdd._next == NULL)
        return;
    else if(_next == NULL)
    {
        _next = toAdd._next;
        _next->_prev = this;
    }
    else
    {
        SVGainElement* tmpTop = _next;
        _next = toAdd._next;
        _next->_prev = this;
        SVGainElement* toAddEnd = toAdd.getLastItem();
        tmpTop->_prev = toAddEnd;
        toAddEnd->_next = tmpTop;
    }
 
    toAdd._next = NULL;
}
 
void GainList:: insertBehind(GainList& toAdd)
{
    if(toAdd._next == NULL)
        return;
    else if(_next == NULL)
    {
        _next = toAdd._next;
        _next->_prev = this;
    }
    else
    {
        SVGainElement* mainListEnd = getLastItem();
        mainListEnd->_next = toAdd._next;
	mainListEnd->_next->_prev = mainListEnd;
    }
    toAdd._next = NULL;
}

bool GainList::isConsistent()
{
    SVGainElement *next, *prev;
    prev = this;
    next = _next;
    bool consistent = true;
    for( ; next != NULL; prev = next, next = next->_next)
    {
	if(prev->_next != next || next->_prev != prev)
	{
	    cout<<"gain list mismatch"<<endl;
	    consistent = false;
	}
    }
    return consistent;
}

ostream& operator<<(ostream& os, const GainList& list)
{
    SVGainElement* cur = list._next;
    if(cur == NULL)
	os<<" EMPTY "<<endl;
    else
    {
        for( ; cur != NULL; cur = cur->_next)
            os<<*cur<<" ";
        os<<endl;
    }
    return os;
}
